A denotational semantics and dataflow construction for logic programs
نویسندگان
چکیده
منابع مشابه
A Dataflow Semantics for Constraint Logic Programs
This paper introduces an alternative operational model for constraint logic programs. First, a transition system is introduced, which is used to define a trace semantics 7-. Next, an equivalent fixpoint semantics F is defined: a dataflow graph is assigned to a program, and a consequence operator on tuples of sets of constraints is given whose least fixpoint determines one set of constraints for...
متن کاملSemantics-Based Dataflow Analysis of Logic Programs
The increased acceptance of Prolog has motivated widespread interest in the semanticsbased dataflow analysis of logic programs and a number of different approaches have been suggested. However, the relationships between these approaches are not clear. The present paper provides a unifying introduction to the approaches by giving novel denotational semantic definitions which capture their essenc...
متن کاملA denotational semantics for equilibrium logic
In this paper we provide an alternative semantics for Equilibrium Logic and its monotonic basis, the logic of Here-and-There (also known as Gödel’s G3 logic) that relies on the idea of denotation of a formula, that is, a function that collects the set of models of that formula. Using the threevalued logic G3 as a starting point and an ordering relation (for which equilibrium/stable models are m...
متن کاملA Denotational Semantics for First-Order Logic
In Apt and Bezem [AB99) we provided a computational interpretation of first-order formulas over arbitrary interpretations. Here we complement this work by introducing a denotational semantics for first-order logic. Additionally, by allowing an assignment of a non-ground term to a variable we introduce in this framework logical variables. The semantics combines a number of well-known ideas from ...
متن کاملModular Denotational Semantics for Compiler Construction ? Sheng
We show the benefits of applying modular monadic semantics to compiler construction. Modular monadic semantics allows us to define a language with a rich set of features from reusable building blocks, and use program transformation and equational reasoning to improve code. Compared to denotational semantics, reasoning in monadic style offers the added benefits of highly modularized proofs and m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90054-x